1 on a Full Meet Base Revision That Satisfies the Categorial Matching Principle

We propose a solution to a problem that is encountered in defining a notion of full meet base revision, ensuring that the output can always be re-used as an input. For this purpose, we introduce the concept of a separable belief base and show that separable bases are exactly those for which the full meet revision closure operator satisfies the extended set of A. G. M. postulates. We then define a full meet revision operator ◊ that associates with any consistent formula α and any separable base B a separable base B◊α. This construction provides an interesting solution to the problem of iterated revisions, as we show that the iterated revision B◊α◊β of the separable base B◊α by β is classically equivalent to the revision B◊(α∧β) of the separable base B by the conjunction of α and β.